Complexity of Cycle Length Modularity Problems in Graphs
نویسندگان
چکیده
The even cycle problem for both undirected [Tho88] and directed [RST99] graphs has been the topic of intense research in the last decade. In this paper, we study the computational complexity of cycle length modularity problems. Roughly speaking, in a cycle length modularity problem, given an input (undirected or directed) graph, one has to determine whether the graph has a cycle C of a specific length (or one of several different lengths), modulo a fixed integer. We denote the two families (one for undirected graphs and one for directed graphs) of problems by (S, m)-UC and (S, m)-DC, where m ∈ N and S ⊆ {0, 1, . . . , m − 1}. (S, m)-UC (respectively, (S,m)-DC) is defined as follows: Given an undirected (respectively, directed) graph G, is there a cycle in G whose length, modulo m, is a member of S? In this paper, we fully classify (i.e., as either polynomial-time solvable or as NP-complete) each problem (S, m)-UC such that 0 ∈ S and each problem (S,m)-DC such that 0 / ∈ S. We also give a sufficient condition on S and m for the following problem to be polynomial-time computable: (S, m)-UC such that 0 / ∈ S.
منابع مشابه
On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles
Several NP-hard optimization problems, like Maximum Independent Set, q-Coloring, and Max-Cut are polynomial time solvable on bipartite graphs. An equivalent characterization of bipartite graphs is that it is the set of all graphs that do not contain any odd length cycle. Thus, a natural question here is what happens to the complexity of these problems if we know that the length of the longest o...
متن کاملEtude d'une nouvelle classe de graphes : les graphes hypotriangulés. (A class of graphs : hypochordal graphs)
In this thesis, we define a new class of graphs : the hypochordal graphs. These graphs satisfy that for any path of length two, there exists an chord or another path of length two between its two endpoints. This class can represent robust networks. Indeed, we show that in such graphs, in the case of an edge or a vertex deletion, the distance between any pair of nonadjacent vertices remains unch...
متن کاملApproximating Longest Directed Paths and Cycles
We investigate the hardness of approximating the longest path and the longest cycle in directed graphs on n vertices. We show that neither of these two problems can be polynomial time approximated within n1-ε for any ε > 0 unless P = NP. In particular, the result holds for digraphs of constant bounded outdegree that contain a Hamiltonian cycle. Assuming the stronger complexity conjecture that S...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کامل